Prize-Collecting Traveling Salesman and Related Problems
نویسندگان
چکیده
The most general version of the Prize Collecting Traveling Salesman Problem (PCTSP) was first introduced by Balas [8]. In this problem, a salesman has to collect a certain amount of prizes (the quota) by visiting cities. A known prize can be collected in every city. Furthermore, by not visiting a city, the salesman incurs a pecuniary penalty. The goal is to minimize the total travel distance plus the total penalty, while starting from a given city and collecting the quota. The problem generalizes both the Quota TSP, which is obtained when all the penalties are set to zero, and the Penalty TSP (sometimes unfortunately also called PCTSP), in which there is no required quota, only penalties. A special case of the Quota TSP is the k-TSP, in which all prizes are unitary (k is the quota). The k-TSP is strongly tied to the problem of finding a tree of minimum cost spanning any k vertices in a graph, called the k-MST problem. The k-MST and the k-TSP are NP-hard. They have been the subject of several studies for good approximation
منابع مشابه
A 4-Approximation Algorithm for k-Prize Collecting Steiner Tree Problems
This paper studies a 4-approximation algorithm for k-prize collecting Steiner tree problems. This problem generalizes both k-minimum spanning tree problems and prize collecting Steiner tree problems. Our proposed algorithm employs two 2-approximation algorithms for k-minimum spanning tree problems and prize collecting Steiner tree problems. Also our algorithm framework can be applied to a speci...
متن کاملA note on the prize collecting traveling salesman problem
We study the version of the prize collecting traveling salesman problem, where the objective is to find a tour that visits a subset of vertices such that the length of the tour plus the sum of penalties associated with vertices not in the tour is as small as possible. We present an approximation algorithm with constant bound. The algorithm is based on Christofides' algorithm for the traveling s...
متن کاملWeighted matching with pair restrictions
The weighted matroid parity problems for the matching matroid and gammoids are among the very few cases for which the weighted matroid parity problem is polynomial time solvable. In this work we extend these problems to a general revenue function for each pair, and show that the resulting problem is still solvable in polynomial time via a standard weighted matching algorithm. We show that in ma...
متن کاملSelf-Organizing Map for the Prize-Collecting Traveling Salesman Problem
In this paper, we propose novel adaptation rules for the selforganizing map to solve the prize-collecting traveling salesman problem (PC-TSP). The goal of the PC-TSP is to find a cost-efficient tour to collect prizes by visiting a subset of a given set of locations. In contrast with the classical traveling salesman problem, where all given locations must be visited, locations in the PC-TSP may ...
متن کاملHybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem
The Prize Collecting Traveling Salesman Problem (PCTSP) can be associated to a salesman that collects a prize in each city visited and pays a penalty for each city not visited, with travel costs among the cities. The objective is to minimize the sum of travel costs and penalties, while including in the tour enough cities to collect a minimum prize. This paper presents one solution procedure for...
متن کامل